Utterance Verification Based on the Likelihood Distance to Alternative Paths

نویسندگان

  • Gies Bouwman
  • Lou Boves
چکیده

Utterance verification tries to reject incorrectly recognised utterances. For this purpose the probability of an error is often estimated by single confidence measure (CM). However, errors can have several different origins, and we argue that notion must be reflected in the design of the utterance verifier. In order to detect both in-vocabulary substitutions and out-of-vocabulary word errors, we compute CMs based on the log-likelihood distance to (1) the second best recognition result and to (2) the most likely free phone string. Experiments in which different CMs were combined in different ways in the recognition of Dutch city names show that Confidence Error Rates [8] are reduced by 10% by combining the CMs using a classification and regression tree instead of a linear combination with a decision threshold.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving Task Independent Utterance Verification Based on On-line Garbage Phoneme Likelihood

Utterance verification based on on-line garbage (OLG) models is often adopted as the benchmark method. However, we find its performance can be remarkably improved by fine-tuning. In this study, OLG phoneme likelihood is proposed. It achieves much better performance and efficiency for task independent utterance verification to reject mis-recognition and OOV utterances than the OLG frame likeliho...

متن کامل

Utterance Verification Using State-Level Log-Likelihood Ratio with Frame and State Selection

This paper suggests utterance verification system using state-level log-likelihood ratio with frame and state selection. We use hidden Markov models for speech recognition and utterance verification as acoustic models and anti-phone models. The hidden Markov models have three states and each state represents different characteristics of a phone. Thus we propose an algorithm to compute state-lev...

متن کامل

Utterance Verificatio Neighborhood Information A

In this paper, we propose to use neighborhood information in model space to perform utterance verification (UV). At first, we present a nested-neighborhood structure for each underlying model in model space and assume the underlying model’s competing models sit in one of these neighborhoods, which is used to model alternative hypothesis in UV. Bayes factors (BF) is first introduced to UV and us...

متن کامل

A new approach to minimize utterance verification error rate for a specific operating point

In many telephony applications that use speech recognition, it is important to identify and reject out-of-vocabulary words or utterances without keywords by means of utterance verification (UV). Typically, UV is performed based on the likelihood ratio of the target model versus an alternative model. The “goodness” of the models and the particular criteria used for estimating these models can ha...

متن کامل

A new approach to utterance verification based on neighborhood information in model space

In this paper, we propose to use neighborhood information in model space to perform utterance verification (UV). At first, we present a nested-neighborhood structure for each underlying model in model space and assume the underlying model’s competing models sit in one of these neighborhoods, which is used to model alternative hypothesis in UV. Bayes factors (BF) is first introduced to UV and us...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002